A polynomial time algorithm in positive define geometric programming with constraints 約束正定式幾何規(guī)劃的一種多項式時間算法
Because it can " t finish in polynomial time , the scheduling problem is known to be np - hard 由于該問題不能在多項式時間內(nèi)求得最優(yōu)解,因而被公認(rèn)為一個np完全問題。
The complexity of kf - diff is o ( nlogn ) , while n is the number of the nodes in the tree , vs . polynomial time for previous algorithms 在算法復(fù)雜度上從先前的多項式時間提高到o ( nlogn ) ,其中n為文檔結(jié)點數(shù)。
Radio communications systems , department of signals , sensors and systems , royal institute of technology , 10044 stockholm , sweden , october 2002 . 10 hajck b , wieselthier j . link scheduling in polynomial time 絕大部分方法在網(wǎng)絡(luò)中有20 30個結(jié)點, 100 200條鏈路時就需要花幾天甚至更多的時間來尋找最優(yōu)調(diào)度。
It is shown that these four types of single machine scheduling problems can be modeled as an assignment problem by mathematical programming method , thus these four types of problems can be solved in polynomial time 用數(shù)學(xué)規(guī)劃的方法證明了四類多準(zhǔn)則下的單機(jī)排序問題可以轉(zhuǎn)化為指派問題,從而這四類問題都多項式時間可解。
A set of algorithms are designed to address the two challenges and then a service pool can be automatically constructed and managed for given reliability and performance requirements in polynomial time 為此,我們設(shè)計了一組算法,在給定的可靠性和性能范圍內(nèi),通過算法的調(diào)度,可以在多項式時間內(nèi)對服務(wù)池自動地進(jìn)行構(gòu)造和管理。
We prove that the worst - case ratio of algorithm d is 15 / 13 , which is better than any other approximation algorithm except polynomial time approximation scheme considering with both worst - case ratio and time complexity 我們證明了對三臺機(jī)情形,算法d的最壞情況界為15 13 ,該算法的最壞情況界和時間復(fù)雜性優(yōu)于除近似方案以外的已有近似算法。
The experiments show that the performance of our method is similar to the ye - 0 . 699 algorithm , which is the best approximate algorithm in polynomial time . but our method can effectively solve the max - bisection problem with a large scale . 2 數(shù)值實驗表明,該方法與ye - 0 . 699近似算法(現(xiàn)有的求解圖的最大二等分問題的最好的多項式時間近似算法)得到的解的性能幾乎沒有差異
As the determination of such optimal multicast routes was computationally intractable in polynomial time , a multicast routing algorithm based on genetic algorithm was proposed to simultaneously optimize different parameter , in which multiple multicast tree route solutions were generated 由于多播路由的最優(yōu)選擇問題在多項式時間內(nèi)難以求解,提出一種使用遺傳算法的路由算法來同時優(yōu)化不同的服務(wù)質(zhì)量指標(biāo),計算產(chǎn)生出幾種路由樹。
polynomial timeとは意味:《數(shù)學(xué)》多項式時間{たこう しき じかん}◆入力の大きさの多項式で押さえられる計算時間。アルゴリズムとして現(xiàn)実に応用可能なことが多い This problem is solvable in polynomial time. この問題は多項式時間で解決可能です。